Unrestricted Faithful Rounding is Good Enough for Some LNS Applications
نویسندگان
چکیده
We propose relaxing the restricted form of faithful rounding used in prior 32-bit Logarithmic Number System (LNS) implementations. Unrestricted faithful rounding yields a three-to six-fold savings in VLSI ROM size (or four-to six-fold savings in FGPA table size) with only modest increase in error. This can be acceptable for the DSP and multimedia applications in which the non-standard LNS is a candidate for adoption. Such applications are cost sensitive, and the tremendous cost reduction of the LNS model proposed here should argue very favourably for its adoption.
منابع مشابه
An Approximate, Efficient Solver for LP Rounding
The vertex cover problem Find a set of vertices that cover the graph LP rounding is a 4 step scheme to approximate combinatorial problems with theoretical guarantees on solution quality. Several problems in machine learning, computer vision and data analysis can be formulated using NP-‐hard combinatorial optimization problems. In many of these applications, approximate solutions for these NP-...
متن کاملAccurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the rounded-to-nearest result of s := ∑ pi for a given vector of floatingpoint numbers pi, as well as algorithms for directed rounding. A special algorithm for computing the sign of s is given, also working for huge dimensions...
متن کاملDesign of a Faithful LNS Interpolator
A design is given for a quadratic interpolator needed by the Logarithmic Number System (LNS). Unlike previous LNS designs that have attempted to produce results consistently better than a oating-point representation of the same word size (32 bits), the design goal here is to minimize memory requirements and system complexity, at the expense of a slight increase in approximation error. Simulatio...
متن کاملAccurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point neighbors of s. If the sum s is a floating-point number, we prove that this is the result of our algorithm. The algorithm adapts to the condition number of the sum, i.e. it is fast for mildly conditioned sums with slo...
متن کاملDesign of Finite Word Length Linear-Phase FIR Filters in the Logarithmic Number System Domain
Logarithmic number system (LNS) is an attractive alternative to realize finite-length impulse response filters because of multiplication in the linear domain being only addition in the logarithmic domain. In the literature, linear coefficients are directly replaced by the logarithmic equivalent. In this paper, an approach to directly optimize the finite word length coefficients in the LNS domai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001